HOL Based First-Order Modal Logic Provers
نویسندگان
چکیده
First-order modal logics (FMLs) can be modeled as natural fragments of classical higher-order logic (HOL). The FMLtoHOL tool exploits this fact and it enables the application of off-the-shelf HOL provers and model finders for reasoning within FMLs. The tool bridges between the qmf-syntax for FML and the TPTP thf0-syntax for HOL. It currently supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics. The approach is evaluated in combination with a meta-prover for HOL, which sequentially schedules various HOL reasoners. The resulting system is very competitive.
منابع مشابه
HOL Provers for First-order Modal Logics - Experiments
Higher-order automated theorem provers have been employed to automate first-order modal logics. Extending previous work, an experiment has been carried out to evaluate their collaborative and individual performances.
متن کاملHOL based Universal Reasoning
At Unilog’2010 I have proposed classical higher-order logic HOL (Church’s type theory [1,9]) as a uniform framework for combining logics [2]. The main claim has been that many non-classical logics are just natural (embedded) fragments of classical HOL. The approach also supports combinations (e.g. fusions) of embedded logics; in particular, bridge rules can be postulated simply as axioms. In th...
متن کامل1 Embedding of First-Order Nominal Logic into Higher-Order Logic
Nominal logic, also referred to as hybrid logic, is a general term for extensions of ordinary modal logics that introduce a new sort of atomic formulae, the socalled nominals. These nominals are only true at one possible world and false at every other world. The shifter, denoted @, can be used to evaluate the truth of a formula φ at a given world corresponding to nominal i as in @iφ. The simple...
متن کاملSystematic Verification of the Modal Logic Cube in Isabelle/HOL
We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube’s logics using automated reasoning tools. Prior work addresses this problem but without restriction to the modal logic cube, and using encodings in first-order logic in combination with first-order automated theorem provers. In contrast, our solutio...
متن کاملMy Life with an Automatic Theorem Prover
Sledgehammer integrates third-party automatic theorem provers in the proof assistant Isabelle/HOL. In the seven years since its first release in 2007, it has grown to become an essential part of most Isabelle users’ workflow. Although a lot of effort has gone into tuning the system, the main reason for Sledgehammer’s success is the impressive power of the external provers, especially E, SPASS, ...
متن کامل